Programming norm change

نویسندگان

  • Nick A. M. Tinnemeier
  • Mehdi Dastani
  • John-Jules Ch. Meyer
چکیده

To adequately deal with the unpredictable and dynamic environments normative frameworks are typically deployed in, mechanisms for modifying the norms at runtime are crucial. We present the syntax and operational semantics of generic programming constructs to facilitate runtime norm modification, allowing a programmer to specify when and how the norms may be changed by external agents or by the normative framework. The norms take on the form of conditional obligations and prohibitions, which instantiate detached obligations and prohibitions (instances). We present rule-based constructs for runtime modification of the norms and their instances, and a mechanism for automatically updating the instances when their underlying norms change.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

A MODIFIED METHOD TO DETERMINE A WELL-DISPERSED SUBSET OF NON-DOMINATED VECTORS OF AN MOMILP PROBLEM

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

متن کامل

The Tchebycheff Norm for Ranking DMUs in Cellular Manufacturing Systems with Assignment Worker

This paper develops an integer mathematical programming model to design the cellular manufacturing systems under data envelopment analysis. Since workers have an important role in doing jobs on machines, assignment of workers to cells becomes a crucial factor for fully utilization of cellular manufacturing systems (CMS). The aim of the proposed is to minimize backorder costs and intercellul...

متن کامل

An alternative transformation in ranking using l1-norm in data envelopment analysis

Jahanshahloo et al. (Appl Math Comput 153:215–224, 2004) propose a method for ranking extremely efficient decision making units (DMUs) in data envelopment analysis (DEA) using super-efficiency technique and l1-norm and they show that the presented method is able to eliminate the existing difficulties in some methods. This paper suggests an alternative transformation to convert the nonlinear mod...

متن کامل

UNBOUNDEDNESS IN MOILP AND ITS EFFICIENT SOLUTIONS

In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010